/**
 * Created with IntelliJ IDEA.
 * Description:二叉树的简单创建（比较简单）
 */

class BTNode{
    public int val;
    public BTNode left;
    public BTNode right;
    public BTNode(int val){
        this.val = val;
    }
}

public class BinaryTree {
    public BTNode root;

    public BTNode creatTree(){
        BTNode A = new BTNode('A');
        BTNode B = new BTNode('B');
        BTNode C = new BTNode('C');
        BTNode D = new BTNode('D');
        BTNode E = new BTNode('E');
        BTNode F = new BTNode('F');
        BTNode G = new BTNode('G');
        BTNode H = new BTNode('H');
        A.left = B;
        A.right = C;
        B.left = D;
        B.right = E;
        E.right = H;
        C.left = F;
        C.right = G;
        return A;
    }
}
